/*************************************************************************
 *
 *  The Contents of this file are made available subject to the terms of
 *  either of the following licenses
 *
 *         - GNU Lesser General Public License Version 2.1
 *         - Sun Industry Standards Source License Version 1.1
 *
 *  Sun Microsystems Inc., October, 2000
 *
 *  GNU Lesser General Public License Version 2.1
 *  =============================================
 *  Copyright 2000 by Sun Microsystems, Inc.
 *  901 San Antonio Road, Palo Alto, CA 94303, USA
 *
 *  This library is free software; you can redistribute it and/or
 *  modify it under the terms of the GNU Lesser General Public
 *  License version 2.1, as published by the Free Software Foundation.
 *
 *  This library is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 *  Lesser General Public License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public
 *  License along with this library; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston,
 *  MA  02111-1307  USA
 *
 *
 *  Sun Industry Standards Source License Version 1.1
 *  =================================================
 *  The contents of this file are subject to the Sun Industry Standards
 *  Source License Version 1.1 (the "License"); You may not use this file
 *  except in compliance with the License. You may obtain a copy of the
 *  License at http://www.openoffice.org/license.html.
 *
 *  Software provided under this License is provided on an "AS IS" basis,
 *  WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
 *  WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
 *  MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
 *  See the License for the specific provisions governing your rights and
 *  obligations concerning the Software.
 *
 *  The Initial Developer of the Original Code is: IBM Corporation
 *
 *  Copyright: 2008 by IBM Corporation
 *
 *  All Rights Reserved.
 *
 *  Contributor(s): _______________________________________
 *
 *
 ************************************************************************/
/*************************************************************************
 * @file 
 * Container for content.It will destroy all children when destroy.
 ************************************************************************/
/*************************************************************************
 * Change History
 * 2005-01-27 create this file.
 * 2005-04-08 add copy constructure.
 ************************************************************************/
#include	"xfcontentcontainer.hxx"
#include	"xftextcontent.hxx"

XFContentContainer::XFContentContainer()
{
}

XFContentContainer::XFContentContainer(const XFContentContainer& other)
{
	std::vector<IXFContent*>::const_iterator it;
	
	for( it = other.m_aContents.begin(); it != other.m_aContents.end(); it++ )
	{
		IXFContent *pContent = *it;
		if( pContent )
		{
			IXFContent *pClone = pContent->Clone();
			if( pClone )
				Add(pClone);
		}
	}
}

XFContentContainer& XFContentContainer::operator=(const XFContentContainer& other)
{
	std::vector<IXFContent*>::const_iterator it;
	
	for( it = other.m_aContents.begin(); it != other.m_aContents.end(); it++ )
	{
		IXFContent *pContent = *it;
		if( pContent )
		{
			IXFContent *pClone = pContent->Clone();
			if( pClone )
				Add(pClone);
		}
	}
	return *this;
}

XFContentContainer::~XFContentContainer()
{
	std::vector<IXFContent*>::iterator it;

	for( it = m_aContents.begin(); it != m_aContents.end(); it++ )
	{
		IXFContent *pContent = *it;
		if( pContent )
			delete pContent;
	}
}

void	XFContentContainer::Add(IXFContent *pContent)
{
	m_aContents.push_back(pContent);
}

void XFContentContainer::InsertAtBegin(IXFContent * pContent)
{
	m_aContents.insert(m_aContents.begin(), pContent);
}
void XFContentContainer::RemoveAt(sal_uInt32 nPos)
{
	m_aContents.erase(m_aContents.begin()+nPos);
}
void	XFContentContainer::Add(const rtl::OUString& text)
{
	XFTextContent *pTC = new XFTextContent();
	pTC->SetText(text);
	Add(pTC);
}

int		XFContentContainer::GetCount() const
{
	return m_aContents.size();
}

void	XFContentContainer::Reset()
{
	std::vector<IXFContent*>::iterator it;
	
	for( it = m_aContents.begin(); it != m_aContents.end(); it++ )
	{
		IXFContent *pContent = *it;
		if( pContent )
			delete pContent;
	}
	m_aContents.clear();
}


IXFContent*	XFContentContainer::FindFirstContent(enumXFContent type)
{
	IXFContent *pRet = NULL;
	IXFContent	*pContent = NULL;
	
	for( int i=0; i<GetCount(); i++ )
	{
		pContent = GetContent(i);
		if( !pContent )
			continue;
		
		enumXFContent eType = pContent->GetContentType();
		if( eType == type )
			return pContent;
		else
		{
			XFContentContainer *pChildCont = static_cast<XFContentContainer*>(pContent);
			if( pChildCont )
			{
				pRet = pChildCont->FindFirstContent(type);
				if( pRet )
					return pRet;
			}
		}
	}
	return pRet;
}

enumXFContent	XFContentContainer::GetContentType()
{
	return enumXFContentContainer;
}

void	XFContentContainer::ToXml(IXFStream *pStrm)
{
	std::vector<IXFContent*>::iterator it;
	
	for( it = m_aContents.begin(); it != m_aContents.end(); it++ )
	{
		IXFContent *pContent = *it;
		if( pContent )
			pContent->ToXml(pStrm);
	}
}

IXFContent* XFContentContainer::GetLastContent()
{
	sal_uInt32 index = m_aContents.size()-1;
	if(index >0)
	{
		return m_aContents[index];
	}

	return NULL;
}

void XFContentContainer::RemoveLastContent()
{
	sal_uInt32 index = m_aContents.size()-1;
	if(index >0)
	{
		m_aContents.erase(m_aContents.begin() + index);
	}
}
